Deverbal Semantics and the Montagovian Generative Lexicon $$\Lambda \!\mathsf {Ty}_n$$ Λ Ty n
نویسندگان
چکیده
We propose a lexical account of action nominals, in particular of deverbal nom-inalisations, whose meaning is related to the event expressed by their base verb. The literature about nominalisations often assumes that the semantics of the base verb completely defines the structure of action nominals. We argue that the information in the base verb is not sufficient to completely determine the semantics of action nominals. We exhibit some data from different languages, especially from Romance language, which show that nominalisations focus on some aspects of the verb semantics. The selected aspects, however, seem to be idiosyncratic and do not automatically result from the internal structure of the verb nor from its interaction with the morphological suffix. We therefore propose a partially lexicalist approach view of deverbal nouns. It is made precise and computable by using the Montagovian Generative Lexicon, a type theoretical framework introduced by Bassac, Mery and Retoré in this journal in 2010. This extension of Montague semantics with a richer type system easily incorporates lexical phenomena like the semantics of action nominals in particular deverbals, including their polysemy and (in)felicitous copredications.
منابع مشابه
A type theoretical framework for natural language semantics: the Montagovian generative lexicon
We present a framework, named the Montagovian generative lexicon, for computing the semantics of natural language sentences, expressed in many sorted higher order logic. Word meaning is depicted by lambda terms of second order lambda calculus (Girard’s system F) with base types including a type for propositions and many types for sorts of a many sorted logic. This framework is able to integrate...
متن کاملThe Montagovian Generative Lexicon ΛT yn: a Type Theoretical Framework for Natural Language Semantics∗
We present a framework, named the Montagovian generative lexicon, for computing the semantics of natural language sentences, expressed in many-sorted higher order logic. Word meaning is described by several lambda terms of second order lambda calculus (Girard’s system F): the principal lambda term encodes the argument structure, while the other lambda terms implement meaning transfers. The base...
متن کاملThe Montagovian generative lexicon ΛTyn: an integrated type-theoretical framework for compositional semantics and lexical pragmatics
In the recent years, different but similar approaches integrated lexical semantics within compositional semantics. These approaches all make use of type theory at least to compose the meanings. We present here with some details one of these approaches, ours, which makes use of second order lambda calculus as a type theory for meaning assembly and of multi sorted higher order predicate logic for...
متن کاملA Montagovian Generative Lexicon
Generative Lexical Semantics aims, among other things, to model cocompositional meanings that classical Montague semantics is unable to express. This paper outlines a simple extension of Montague semantics which amends the standard compositional mechanisms for the use of specific terms provided by the lexicon, in order to account for this theory. We hope that such a logical system would prove b...
متن کاملTyped Hilbert Epsilon Operators and the Semantics of Determiner Phrases
The semantics of determiner phrases, be they definite descriptions, indefinite descriptions or quantified noun phrases, is often assumed to be a fully solved question: common nouns are properties, and determiners are generalised quantifiers that apply to two predicates: the property corresponding to the common noun and the one corresponding to the verb phrase. We first present a criticism of th...
متن کاملCOSPECTRALITY MEASURES OF GRAPHS WITH AT MOST SIX VERTICES
Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Logic, Language and Information
دوره 23 شماره
صفحات -
تاریخ انتشار 2014